On the Unequal Error Protection Capability of a q-ary Image of a Low-Rate q-ary Cyclic Code
نویسندگان
چکیده
An algorithm for finding the unequal error protection (UEP) capability of a q-ary image of a low-rate qm-ary cyclic code is presented by combining its concatenated structure with the UEP capability of concatenated codes. The results are independent of a choice of a basis to be used for expanding an element over GF(qm) into GF(q). A table of the UEP capability of binary images of low-rate Reed-Solomon codes over GF(26) is given. It is shown that the encoding and decoding algorithms for superimposed concatenated codes can be applied to a q-ary image as a linear UEP code. key words: unequal error protection, q-ary image of qm-ary cyclic code, concatenated structure
منابع مشابه
New multilevel codes over GF(q)
In this paper, we apply set partitioning to multi-dimensional signal spaces over GF(q), particularly GFq-l(q) and GFq(q), and show how to construct both multi-level block codes and multi-level trellis codes over GF(q). We present two classes of multi-level (n, k, d) block codes over GF(q) with block length n, number of information symbols k, and minimum ,1-1 • { d } distance d_n >_ d, where n =...
متن کاملThe q-ary image of some qm-ary cyclic codes: Permutation group and soft-decision decoding
Using a particular construction of generator matrices of the -ary image of -ary cyclic codes, it is proved that some of these codes are invariant under the action of particular permutation groups. The equivalence of such codes with some two-dimensional (2-D) Abelian codes and cyclic codes is deduced from this property. These permutations are also used in the area of the soft-decision decoding o...
متن کاملOptimal locally repairable codes of distance 3 and 4 via cyclic codes
Like classical block codes, a locally repairable code also obeys the Singleton-type bound (we call a locally repairable code optimal if it achieves the Singleton-type bound). In the breakthrough work of [14], several classes of optimal locally repairable codes were constructed via subcodes of Reed-Solomon codes. Thus, the lengths of the codes given in [14] are upper bounded by the code alphabet...
متن کاملOn Repeated-root Cyclic Codes
A parity-check matrix for a q -ary repeated-root cyclic code is derived using the Hasse derivative. Then the min imum distance of a q-ary repeated-root cyclic code C is expressecin terms of the min imum distance of a certain simple-root cyclic code C that is determined by C. With the help of this result, several binary repeated-root cyclic codes of lengths up to n = 62 are shown to contain the ...
متن کاملSelf-orthogonality of q-ary Images of qm-ary Codes and Quantum Code Construction
A code over GF(qm) can be imaged or expanded into a code over GF(q) using a basis for the extension field over the base field. The properties of such an image depend on the original code and the basis chosen for imaging. Problems relating the properties of a code and its image with respect to a basis have been of great interest in the field of coding theory. In this work, a generalized version ...
متن کامل